OpenFlow based Load Balancing for Fat-Tree Networks with Multipath Support
نویسندگان
چکیده
Data center networks are designed for satisfying the data transmission demand of densely interconnected hosts in the data center. The network topology and routing mechanism can affect the performance and latency significantly. Nowadays, the fat-tree network is one of the most widely used topologies for data center networks. Network engineers also adopt load balancing methods in the design of routing algorithms. However, the requirement of load balancing routing in fat-tree networks cannot be fully satisfied by traditional approaches. The main reason is the lack of efficient ways to obtain network traffic statistics from each network device. As a solution, the OpenFlow protocol enables monitoring traffic statistics by a centralized controller. To achieve high performance and low latency, we present a load balancer for OpenFlow based data center networks. We implement a dynamic routing algorithm in the load balancer. The task of the algorithm is to distribute traffic of upcoming network flows and make each alternative path receive equal amounts of traffic load. It can apply to large scale networks and schedule data flows dynamically. Our implementation uses the OpenFlow controller Beacon and network emulator Mininet. The evaluation results demonstrate that our dynamic load balancing routing algorithm is superior over not only the none load balancing routing algorithm but also the static load balancing algorithm.
منابع مشابه
Randomized Load-balanced Routing for Fat-tree Networks
Fat-tree networks have been widely adopted to High Performance Computing (HPC) clusters and to Data Center Networks (DCN). These parallel systems usually have a large number of servers and hosts, which generate large volumes of highly-volatile traffic. Thus, distributed load-balancing routing design becomes critical to achieve high bandwidth utilization, and low-latency packet delivery. Existin...
متن کاملK-Multipath Routing Mechanism with Load Balancing in Wireless Sensor Networks
It is desirable to allow packets with the same source and destination to take more than one possible path. This facility can be used to ease congestion and overcome node failures. In this paper, we design and implement a k-multipath routing algorithm that allows a given source node send samples of data to a given sink node in a large scale sensor networks. Multipath routing can increase endto-e...
متن کاملOpenFlow-Based Dynamic Server Cluster Load Balancing with Measurement Support
—In the current cloud computing environment, the size of the server cluster in the data center is growing in response to the increasing traffic. Due to the use of multiple replicas in the server cluster to provide the same services, effective load balancing as a key technology is very important. In this paper we implement and evaluate an alternative loadbalancing architecture using OpenFlow sw...
متن کاملTorii-HLMAC: Distributed, Fault-tolerant Data Center Architecture with Multiple Tree-based Addressing and Forwarding
Data center networks are increasingly relying on Ethernet and flat layer two networks due to its excellent price and performance ratio and configuration convenience. Different approaches to implement a data center fabric have been recently proposed to overcome the limitations of Spanning Tree protocol (ST) and the configuration complexity of Multiple Spanning Tree Protocol. PortLand [1] is a re...
متن کاملVirtualization of Data Center towards Load Balancing and Multi- Tenancy
Virtualization is an essential step before a bare metal data center being ready for commercial usage, because it bridges the foreground interface for cloud tenants and the background resource management on underlying infrastructures. A concept at the heart of the foreground is multi-tenancy, which deals with logical isolation of shared virtual computing, storage, and network resources and provi...
متن کامل